A Framework for Task Reallocation in Distributed Computing Systems with Non-Markovian Communication Delays

نویسندگان

  • Jorge E. Pezoa
  • Majeed M. Hayat
  • Zhuoyao Wang
چکیده

This paper presents a general framework for optimal task reallocation in heterogeneous distributed computing systems (DCSs). The framework relies on a rigorous analytical model for the stochastic execution time of a workload. The model takes into account the heterogeneity and randomness of both service times and communication delays, an arbitrary task-reallocation policy as well as the stochastic failure times of servers. Auxiliary age variables are introduced in the analysis to capture the memory associated with the non-Markovian (nonexponential) communication and service random times, thereby enabling a recursive analytical characterization for the execution time of a workload. The framework is employed to devise task reallocation policies that optimize three metrics: average execution time of a workload, quality-of-service guarantees and reliability in executing a workload. Implications of the nonexponential times on these metrics are studied, and results are compared to those obtained using a Markovian formulation; in particular, the effect of increasing the mean communication times is investigated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Task Reallocation for Maximal Reliability in Distributed Computing Systems with Uncertain Topologies and Non-Markovian Delays

The ability to model and optimize reliability is central in designing survivable distributed computing systems (DCSs) where servers are prone to fail permanently. In this paper the service reliability of a DCS in uncertain topologies is analytically characterized by using a novel regeneration-based probabilistic analysis. The analysis takes into account the stochastic failure times of servers, ...

متن کامل

An Effective Task Scheduling Framework for Cloud Computing using NSGA-II

Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...

متن کامل

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

Synchronization criteria for T-S fuzzy singular complex dynamical networks with Markovian jumping parameters and mixed time-varying delays using pinning control

In this paper, we are discuss about the issue of synchronization for singular complex dynamical networks with Markovian jumping parameters and additive time-varying delays through pinning control by Takagi-Sugeno (T-S) fuzzy theory.The complex dynamical systems consist of m nodes and the systems switch from one mode to another, a Markovian chain with glorious transition probabili...

متن کامل

Design of Observer-based H∞ Controller for Robust Stabilization of Networked Systems Using Switched Lyapunov Functions

In this paper, H∞ controller is synthesized for networked systems subject to random transmission delays with known upper bound and different occurrence probabilities in the both of feedback (sensor to controller) and forward (controller to actuator) channels. A remote observer is employed to improve the performance of the system by computing non-delayed estimates of the sates. The closed-loop s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009